Performance Analysis of Mapping Strategies for Parallel Simulation

This paper presents an analytical model to evaluate the performance of conservative pamllel simulation using a finite-buffered multistage interconnection network as an example. The model is formalized based on two important time components in parallel and distributed processing: computation time and communication time. Our mathematical analysis identifies the major constituents of simulation overheads that affect the performance of pamllel simulation. We also show that a perfectly balanced workload distribution may not necessarily translates into better performance. On the contmry, we have shown that a balanced mapping of workload may increase communication overheads resulting in a longer simulation elapsed time.